An explicit formula for the characters of the symmetric group
نویسنده
چکیده
The characters of the irreducible representations of the symmetric group play an important role in many areas of mathematics. However, since the early work of Frobenius [5] in 1900, no explicit formula was found for them. The characters of the symmetric group were computed through various recursive algorithms, but explicit formulas were only known for about ten particular cases [5, 9]. The purpose of this paper is to give such an explicit expression in the general case. The irreducible representations of the symmetric group Sn of n letters are labelled by partitions λ of n (i.e. weakly decreasing sequences of positive integers summing to n). Their characters χ are evaluated at a conjugacy class of Sn, labelled by a partition μ giving the cycle-type of the class. Let χμ be the value of the character χ λ at a permutation of cycle-type μ. We shall give an explicit formula for the normalized character χ̂μ = χμ/dimλ. This result was announced in [20]. It should be first emphasized that our formula gives the dependence of χ̂μ with respect to λ in terms of the “contents” of this partition. More precisely the normalized character χ̂μ is expressed as some (unique) symmetric function evaluated on the contents of λ. This description of characters by content evaluation was proved in [13] and [3]. Previously the importance of contents had been apparent from the works of Jucys [11] and Murphy [24]. The fact had been noticed by Suzuki [29], Lascoux and Thibon [15] and Garsia [6].
منابع مشابه
An explicit formula for the number of fuzzy subgroups of a finite abelian $p$-group\ of rank two
Ngcibi, Murali and Makamba [Fuzzy subgroups of rank two abelian$p$-group, Iranian J. of Fuzzy Systems {bf 7} (2010), 149-153]considered the number of fuzzy subgroups of a finite abelian$p$-group $mathbb{Z}_{p^m}times mathbb{Z}_{p^n}$ of rank two, andgave explicit formulas for the cases when $m$ is any positiveinteger and $n=1,2,3$. Even though their method can be used for thecases when $n=4,5,l...
متن کاملPower Sum Expansion of Chromatic Quasisymmetric Functions
The chromatic quasisymmetric function of a graph was introduced by Shareshian and Wachs as a refinement of Stanley’s chromatic symmetric function. An explicit combinatorial formula, conjectured by Shareshian and Wachs, expressing the chromatic quasisymmetric function of the incomparability graph of a natural unit interval order in terms of power sum symmetric functions, is proven. The proof use...
متن کاملFuzzy subgroups of the direct product of a generalized quaternion group and a cyclic group of any odd order
Bentea and Tu{a}rnu{a}uceanu~(An. c{S}tiinc{t}. Univ. Al. I.Cuza Iac{s}, Ser. Nouv{a}, Mat., {bf 54(1)} (2008), 209-220)proposed the following problem: Find an explicit formula for thenumber of fuzzy subgroups of a finite hamiltonian group of type$Q_8times mathbb{Z}_n$ where $Q_8$ is the quaternion group oforder $8$ and $n$ is an arbitrary odd integer. In this paper weconsider more general grou...
متن کاملHecke Algebra Actions on the Coinvariant Algebra
Two actions of the Hecke algebra of type A on the corresponding polynomial ring are introduced. Both are deformations of the natural action of the symmetric group on polynomials, and keep symmetric functions invariant. An explicit combinatorial formula is given for the resulting graded characters on the coinvariant algebra.
متن کاملNoncommutative Cyclic Characters of Symmetric Groups
We deene noncommutative analogues of the characters of the symmetric group which are induced by transitive cyclic subgroups (cyclic characters). We investigate their properties by means of the formalism of noncommutative symmetric functions. The main result is a multiplication formula whose commutative projection gives a combinatorial formula for the resolution of the Kronecker product of two c...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2008